https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Parameterized low-distortion embeddings: graph metrics into lines and trees https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:4423 Wed 11 Apr 2018 15:43:28 AEST ]]> On complexity of lobbying in multiple referenda https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2613 Wed 11 Apr 2018 15:20:50 AEST ]]> Polynomial-time linear kernelization for cluster editing https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2595 Wed 11 Apr 2018 14:44:55 AEST ]]> Parameterized complexity of the clique partition problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:6021 Sat 24 Mar 2018 10:24:10 AEDT ]]> Clustering with partial information https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9422 2.]]> Sat 24 Mar 2018 08:39:18 AEDT ]]> What makes equitable connected partition easy https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8862 Sat 24 Mar 2018 08:39:02 AEDT ]]> Haplotype inference constrained by plausible haplotype data https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8866 Sat 24 Mar 2018 08:39:01 AEDT ]]> The complexity ecology of parameters: an illustration using bounded max leaf number https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7825 Sat 24 Mar 2018 08:37:39 AEDT ]]> On the parameterized complexity of multiple-interval graph problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7815 Sat 24 Mar 2018 08:37:37 AEDT ]]> W-Hierarchies defined by symmetric gates https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9504 Sat 24 Mar 2018 08:35:36 AEDT ]]> Reaching out to the media: become a computer science ambassador https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:14342 Sat 24 Mar 2018 08:23:06 AEDT ]]> Milling a graph with turn costs: a parameterized complexity perspective https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11740 x at each vertex x giving, for each ordered pair of edges (e,f) incident at x, the turn cost at x of a walk that enters the vertex on edge e and departs on edge f. We describe an initial study of the parameterized complexity of the problem.]]> Sat 24 Mar 2018 08:07:49 AEDT ]]> Clustering with partial information https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5965 2.]]> Sat 24 Mar 2018 07:47:27 AEDT ]]> A purely democratic characterization of W[1] https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5972 Sat 24 Mar 2018 07:47:25 AEDT ]]> On the parameterized complexity of layered graph drawing https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5471 Sat 24 Mar 2018 07:47:04 AEDT ]]> Parameterized complexity and biopolymer sequence comparison https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5488 Sat 24 Mar 2018 07:47:00 AEDT ]]> Parameterized approximation of dominating set problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5217 Sat 24 Mar 2018 07:44:20 AEDT ]]>